Clustering Pengunjung Mall Menggunakan Metode K-Means dan Particle Swarm Optimization

نویسندگان

چکیده

This research aims to cluster mall visitors. is motivated by the mall's income which has decreased since pandemic. Later from these several clusters we can find out characteristics of Those will be used later increase mall. In this research, use a dataset Kaggle named Pengunjung_mall in CSV format processed using Python language on Jupiter Notebooks K-Means method. To ensure how accurate method is, optimization carried PSO (Particle Swarm Optimization) After performing clustering and Jupyter Notebook, results then evaluated with DBI (Davies Bouldin Index) Microsoft Excel well Clustering generated. The obtained are as reference determine visitors one strategy Mall profits. As result, have succeeded dividing customers into 5 based their annual earned expense scores. been optimized increasing resulting proven Davies Index concluded that who high levels spending scores targets highest priority level for malls.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Klasifikasi Data Cardiotocography Dengan Integrasi Metode Neural Network Dan Particle Swarm Optimization

Backpropagation (BP) adalah sebuah metode yang digunakan dalam training Neural Network (NN) untuk menentukan parameter bobot yang sesuai. Proses penentuan parameter bobot dengan menggunakan metode backpropagation sangat dipengaruhi oleh pemilihan nilai learning rate (LR)-nya. Penggunaan nilai learning rate yang kurang optimal berdampak pada waktu komputasi yang lama atau akurasi klasifikasi yan...

متن کامل

Particle Swarm Optimization Algorithm Based k-means and Fuzzy c-means clustering

Data mining is the process of extracting hidden patterns from huge data. Among the various clustering algorithms, k-means is the one of most widely used clustering technique in data mining. The performance of k-means clustering depends on the initial clusters and might converge to local optimum. K-means does not guarantee the unique clustering because it generates different results with randoml...

متن کامل

The K-means Clustering Algorithm Based on Chaos Particle Swarm

Proposed the Algorithm of K-means (CPSOKM) based on Chaos Particle Swarm in order to solve the problem that K-means algorithm sensitive to initial conditions and is easy to influence the clustering effect. On the selection of the initial value problem, algorithm using particle swarm algorithm to balance the random value uncertainty, and then by introducing a chaotic sequence, the particles move...

متن کامل

A Particle Swarm Optimization Based Chaotic K-means Evolutionary Approach

The proposed approach brings up a manner of cognitiveness that inherits a paradigm in particle swarm optimization to implement a chaotic mapping and enhanced by K-means clustering algorithm. In this work, named KCPSO, chaotic mapping with ergodicity, irregularity and the stochastic properties in PSO contributes to global search while K-means with clustering properties in PSO results in rapid co...

متن کامل

A hybrid sequential approach for data clustering using K-Means and particle swarm optimization algorithm

Clustering is a widely used technique of finding interesting patterns residing in the dataset that are not obviously known. The K-Means algorithm is the most commonly used partitioned clustering algorithm because it can be easily implemented and is the most efficient in terms of the execution time. However, due to its sensitiveness to initial partition it can only generate a local optimal solut...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Jurnal media informatika Budidarma

سال: 2022

ISSN: ['2548-8368', '2614-5278']

DOI: https://doi.org/10.30865/mib.v6i3.4172